12 research outputs found
On Ramsey Theory and Slow Bootstrap Percolation
This dissertation concerns two sets of problems in extremal combinatorics. The major part, Chapters 1 to 4, is about Ramsey-type problems for cycles. The shorter second part, Chapter 5, is about a problem in bootstrap percolation. Next, we describe each topic more precisely. Given three graphs G, L1 and L2, we say that G arrows (L1, L2) and write G â (L1, L2), if for every edge-coloring of G by two colors, say 1 and 2, there exists a color i whose color class contains Li as a subgraph. The classical problem in Ramsey theory is the case where G, L1 and L2 are complete graphs; in this case the question is how large the order of G must be (in terms of the orders of L1 andL2) to guarantee that G â (L1, L2). Recently there has been much interest in the case where L1 and L2 are cycles and G is a graph whose minimum degree is large. In the past decade, numerous results have been proved about those problems. We will continue this work and prove two conjectures that have been left open. Our main weapon is Szemeredi\u27s Regularity Lemma.Our second topic is about a rather unusual aspect of the fast expanding theory of bootstrap percolation. Bootstrap percolation on a graph G with parameter r is a cellular automaton modeling the spread of an infection: starting with a set A0, cointained in V(G), of initially infected vertices, define a nested sequence of sets, A0 â A1 â. . . â V(G), by the update rule that At+1, the set of vertices infected at time t + 1, is obtained from At by adding to it all vertices with at least r neighbors in At. The initial set A0 percolates if At = V(G) for some t. The minimal such t is the time it takes for A0 to percolate. We prove results about the maximum percolation time on the two-dimensional grid with parameter r = 2
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation
Let be any non negative integer and let be any undirected graph in which a subset of vertices are initially infected. We consider the following process in which, at every step, each non-infected vertex with at least infected neighbours becomes and an infected vertex never becomes non-infected. The problem consists in determining the minimum size of an initially infected vertices set that eventually infects the whole graph . Note that = 1 for any connected graph . This problem is closely related to cellular automata, to percolation problems and to the Game of Life studied by John Conway. Note that for any connected graph . The case when is the grid and is well known and appears in many puzzles books, in particular due to the elegant proof that shows that = for all â . We study the cases of square grids and tori when â {3, 4}. We show that = for every even and that ††+ 1 for any odd. When is odd, we show that both bounds are reached, namely = if ⥠5 (mod 6) or = 2 â 1 for any â , and = + 1 if â {9, 13}. Finally, for all â , we give the exact expression of and of when â {3, 4}
Ramsey theory for cycles and paths
Os principais objetos de estudo neste trabalho sĂŁo os nĂșmeros de Ramsey para circuitos e o lema da regularidade de SzemerĂ©di. Dados grafos , o nĂșmero de Ramsey Ă© o menor inteiro tal que, para qualquer coloração com cores das arestas do grafo completo com vĂ©rtices, existe uma cor para a qual a classe de cor correspondente contĂ©m como um subgrafo. Estaremos especialmente interessados no caso em que os grafos sĂŁo circuitos. Obtemos um resultado original solucionando o caso em que e sĂŁo circuitos pares de mesmo tamanho.The main objects of interest in this work are the Ramsey numbers for cycles and the SzemerĂ©di regularity lemma. For graphs , the Ramsey number is the minimum integer such that for any edge-coloring of the complete graph with~ vertices by colors there exists a color for which the corresponding color class contains~ as a subgraph. We are specially interested in the case where the graphs are cycles. We obtained an original result solving the case where and are even cycles of the same length
The 3-colored Ramsey number of even cycles
Denote by R(L,L,L) the minimum integer N such that any 3-coloring of the edges of the complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and ErdĆs conjectured that when L is the cycle Cn on n vertices, R(Cn,Cn,Cn)=4nâ3 for every odd n>3. Ćuczak proved that if n is odd, then R(Cn,Cn,Cn)=4n+o(n), as nââ, and Kohayakawa, Simonovits and Skokan confirmed the BondyâErdĆs conjecture for all sufficiently large values of n. Figaj and Ćuczak determined an asymptotic result for the âcomplementaryâ case where the cycles are even: they showed that for even n, we have R(Cn,Cn,Cn)=2n+o(n), as nââ. In this paper, we prove that there exists n1 such that for every even nâ©Ÿn1, R(Cn,Cn,Cn)=2n
Democracia na América Latina : democratização, tensÔes e aprendizados
Ă possĂvel esboçar pistas sobre as transformaçÔes nos repertĂłrios de
ação coletiva dos movimentos sociais após o golpe de 2016. Durante o lulismo, os
movimentos, por meio do ÂdiĂĄlogo crĂticoÂ, interagiam com maior recorrĂȘncia com
o Estado, por meio de canais participativos. Todavia, apĂłs o golpe, abrem-se
oportunidades polĂticas para o confronto polĂtico, possibilitando a adoção de
prĂĄticas polĂticas disruptivas frente ao governo Temer. NĂŁo hĂĄ fĂłrmula pronta para
o que estĂĄ por vir no Brasil. Afinal, estamos no Âtempo das incertezasÂ. Contudo, Ă©
possĂvel perceber que, em que pese o paĂs estar sofrendo uma guinada Ă direita, ela
mesma pode abrir oportunidades para açÔes disruptivas de confronto, recolocando
o terreno da sociedade civil como uma arena de disputas de projetos polĂticos e de
reconfiguração das prĂĄticas polĂticas tradicionais